Big O notation - PDFSEARCH.IO - Document Search Engine

Big O notation
Results: 335

#	Item
31	Rigorous Runtime Analysis of a (µ+1) ES for the Sphere Function ∗ Carsten Witt Add to Reading List Source URL: ls2-www.cs.uni-dortmund.de Language: English - Date: 2005-07-04 05:50:15 Mathematical analysis Mathematics Analysis Measure theory Probability distributions Support Big O notation Central limit theorem
32	Computing Fundamentals Salvatore Filippone 2012–2013 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2014-09-23 08:12:56 Analysis of algorithms Computational complexity theory Best worst and average case Time complexity Algorithm Fast Fourier transform Big O notation Average-case complexity Sorting algorithm
33	Computing Fundamentals Salvatore Filippone 2013–2014 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2014-09-23 08:13:16 Computational complexity theory Analysis of algorithms Best worst and average case Time complexity Algorithm Fast Fourier transform Big O notation Average-case complexity Sorting algorithm
34	Computational Complexity of Ant Colony Optimization and Its Hybridization Frank Neumann1 , Dirk Sudholt2⋆ , and Carsten Witt3⋆ 1 Max-Planck-Institut f¨ Add to Reading List Source URL: ls2-www.cs.tu-dortmund.de Language: English - Date: 2009-04-06 09:15:22 Cybernetics Operations research Mathematical optimization Ant colony optimization algorithms Search algorithms Genetic algorithm Travelling salesman problem Evolutionary algorithm Algorithm Big O notation
35	Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces Jens J¨ agersk¨ upper? FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany Add to Reading List Source URL: ls2-www.cs.uni-dortmund.de Language: English - Date: 2004-04-23 06:40:29 Lemmas Differential forms Differential geometry Analysis of algorithms Asymptotic analysis Big O notation Closed and exact differential forms Differential geometry of surfaces Expected value
36	Opportunistic Data Structures with Applications Paolo Ferragina∗ Giovanni Manzini† Abstract Add to Reading List Source URL: people.unipmn.it Language: English Arrays Analysis of algorithms Suffix array Suffix tree String searching algorithm Time complexity Trie FO Logarithm Big O notation Compressed suffix array Rope
37	Genome Informatics 15(2): 141–Increasing Feasibility of Optimal Gene Network Estimation Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2004-12-20 01:25:30 Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation Dynamic programming Bayesian network Algorithm HeldKarp algorithm Expectationmaximization algorithm
38	Fault Tolerant External Memory Algorithms Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1,? , and Thomas Mølhave1,? BRICS, MADALGO?? , Department of Computer Science, Aarhus University, Denmark. {gerth,jallan,thom Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:56 Analysis of algorithms Time complexity Sorting algorithm Algorithm Randomized algorithm NC Big O notation Best worst and average case B-tree Soft heap Oblivious data structure
39	styleguide_and_checklist.doc Add to Reading List Source URL: cep.lse.ac.uk Language: English - Date: 2003-10-06 05:47:21 JEL classification codes Centre for Economic Performance Digital media Research Typographic alignment Electronic submission HTML element Big O notation
40	V I C T O R I AN H AN G G L I D I N G AN D P AR AG L I D I N G AS S O C I AT I O N MEETING RECORD Committee meeting 19 May 2008 PARTICIPANT NAME & ORGANISATION Add to Reading List Source URL: www.vhpa.org.au Language: English - Date: 2016-05-08 08:15:30 Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation

UPDATE